multiplicative congruence

См. также в других словарях:

• Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… …   Wikipedia

• Multiplicative order — In number theory, given an integer a and a positive integer n with gcd(a,n) = 1, the multiplicative order of a modulo n is the smallest positive integer k with ak ≡ 1 (mod n). The order of a modulo n is usually written ordn(a), or On(a). Contents …   Wikipedia

• Modular multiplicative inverse — The modular multiplicative inverse of an integer a modulo m is an integer x such that That is, it is the multiplicative inverse in the ring of integers modulo m. This is equivalent to The multiplicative inverse of a modulo m exists if and only if …   Wikipedia

• Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

• Modular arithmetic — In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers wrap around after they reach a certain value the modulus. The Swiss mathematician Leonhard Euler pioneered the modern… …   Wikipedia

• NOMBRES (THÉORIE DES) - Nombres algébriques — Les mathématiciens grecs avaient découvert que certains rapports de grandeurs ne sont pas rationnels, c’est à dire qu’ils ne sont pas égaux au rapport de deux entiers: il en est ainsi du rapport de la diagonale d’un carré à son côté, puisque… …   Encyclopédie Universelle

• List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

• Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …   Wikipedia

• DIVISIBILITÉ — L’étude élémentaire de la divisibilité dans l’anneau Z des entiers relatifs résulte de l’existence de la division euclidienne qui entraîne que cet anneau est principal. Les propriétés générales des anneaux principaux sont exposées dans l’article… …   Encyclopédie Universelle

• Projet:Mathématiques/Liste des articles de mathématiques — Cette page n est plus mise à jour depuis l arrêt de DumZiBoT. Pour demander sa remise en service, faire une requête sur WP:RBOT Cette page recense les articles relatifs aux mathématiques, qui sont liés aux portails de mathématiques, géométrie ou… …   Wikipédia en Français

• Cubic reciprocity — is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x3 ≡ p (mod q) is solvable; the word reciprocity comes from the form of the main theorem, which states that …   Wikipedia